Efficient Prefix Computation on Faulty Hypercubes
نویسندگان
چکیده
Consider an n-dimensional SIMD hypercube Hn with 3n/2 − 1 faulty nodes. Given 2 operands, this paper presents an efficient algorithm for prefix computation on the faulty Hn. Employing the newly proposed delay-update technique and the subcube partition scheme, the proposed algorithm takes n+5logn+7 steps, and it tolerates n/2 more faulty nodes than does Raghavendra and Sridhar’s algorithm [4] although 11 extra steps are needed.
منابع مشابه
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes and unicasting is a one-to-one communication between two nodes in the hypercube. Each node is associated with a safety level which is an approximated measure of the number and distribution of faulty nodes in the neighborh...
متن کاملA Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes
An incomplete hypercube possesses virtually every advantage of complete hypercubes, including simple deadlock-free routing, a small diameter, bounded link traffic density, a good support of parallel algorithms, and so on. It is natural to reconfigure a faulty hypercube into a maximum incomplete cube so as to lower potential performance degradation, because a hypercube so reconfigured often resu...
متن کاملThe Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that share...
متن کاملFault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
In this paper, we study fault tolerance measures for m-ary n-dimensional hypercubes based on the concept of forbidden faulty sets. In a forbidden faulty set, certain nodes cannot be faulty at the same time and this model can better reflect fault patterns in a real system than the existing ones. Specifically, we study the bounds of the minimum vertex cut set for m-ary n-dimensional hypercubes by...
متن کاملReconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes
The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH graph. As the model the authors proposed, an algorithm is developed for the embedding with expansio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 17 شماره
صفحات -
تاریخ انتشار 2001